Sequence Alignment as a Set Partitioning Problem
نویسندگان
چکیده
منابع مشابه
Record Linkage as DNA Sequence Alignment Problem
Since modern database applications increasingly need to deal with dirty data due to a variety of reasons (e.g., data entry errors, heterogeneous formats, and ambiguous terms), considerable recent efforts have focused on the (record) linkage problem to determine if two entities represented as relational records are approximately the same or not. In this paper, we propose a novel idea of using th...
متن کاملMultiple Sequence Alignment as a Facility Location Problem
A connection is made between certain multiple sequence alignment problems and facility location problems, and the existence of a PTAS (polynomial time approximation scheme) for these problems is shown. Moreover, it is shown that multiple sequence alignment with SP-score and fixed gap penalties is MAX SNP-hard.
متن کاملModelling transfer line design problem via a set partitioning problem
The design of a transfer line is considered. This line is used for a repetitive execution of a given set of operations to produce identical items. The line is composed of a sequence of workstations equipped with processing modules (blocks). Each block performs specific operations. The machined items move along the workstations in the same direction. There is the same cost associated with each w...
متن کاملA Flow shop Production Planning Problem with basic period policy and Sequence Dependent set up times
Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...
متن کاملLocal Sequence Alignment Against a Database Problem
Local Sequence Algignment. The local sequence alignment problem is defined as follows: Given two strings S = s 1. .. s n and T = t 1. .. t m , a substitution matrix Score and an insertion/deletion penalty δ, find a pair of substrings s i. .. s i+k of S and t j. .. t j+l of T that have the best overall alignment score, and return the best alignment for them. Local Sequence Algignment against a d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Natural Language Processing
سال: 2016
ISSN: 1340-7619,2185-8314
DOI: 10.5715/jnlp.23.175